Multiresolution Matrix Compression

نویسندگان

  • Nedelina Teneva
  • Pramod Kaushik Mudrakarta
  • Risi Kondor
چکیده

Multiresolution Matrix Factorization (MMF) is a recently introduced method for finding multiscale structure and defining wavelets on graphs and matrices. MMF can also be used for matrix compression (sketching). However, the original MMF algorithm of (Kondor et al., 2014) scales with n or worse (where n is the number of rows/columns in the matrix to be factorized) making it infeasible for large scale problems. In this paper we describe pMMF, a fast parallel MMF algorithm, which can scale to n in the range of millions. Our experimental results show that when used for matrix compression, pMMF often achieves much lower error than competing algorithms (especially on network data), yet for sparse matrices its running time scales close to linearly with n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Inversion of Poisson’s Integral in the Wavelet Domain

A wavelet transform algorithm combined with a conjugate gradient method is used for the inversion of Poisson’s integral (downward continuation), used in airborne gravimetry applications. The wavelet approximation is dependent on orthogonal wavelet base functions. The integrals are approximated in finite multiresolution analysis subspaces. Mallat’s algorithm is used in the multiresolution analys...

متن کامل

Learning-based multiresolution transforms with application to image compression

In Harten’s framework, multiresolution transforms are defined by predicting finer resolution levels of information from coarser ones using an operator, called prediction operator, and defining details (or wavelet coefficients) that are the difference between the exact and predicted values. In this paper we use tools of statistical learning in order to design a more accurate prediction operator ...

متن کامل

Multiresolution Matrix Factorization

Large matrices appearing in machine learning problems often have complex hierarchical structures that go beyond what can be found by traditional linear algebra tools, such as eigendecomposition. Inspired by ideas from multiresolution analysis, this paper introduces a new notion of matrix factorization that can capture structure in matrices at multiple different scales. The resulting Multiresolu...

متن کامل

SVD-Wavelet Algorithm for image compression

We explore the use of the singular value decomposition (SVD) in image compression. We link the SVD and the multiresolution algorithms. In [22] it is derived a multiresolution representation of the SVD decomposition, and in [15] the SVD algorithm and Wavelets are linked, proposing a mixed algorithm which roughly consist on applying firstly a discrete Wavelet transform and secondly the SVD algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016